Performance Evaluation of Accurate Ellipse Fitting

نویسنده

  • Kenichi Kanatani
چکیده

This paper studies numerical schemes for fitting an ellipse to points in an image. First, the problem is posed as maximum likelihood, and the relationship to the KCR lower bound is stated. Then, the algorithms of FNS, HEIV, renormalization, and Gauss-Newton iterations are described. Using simulated and real image data, their convergence properties are compared, and their dependence on the shape of the arc to which an ellipse is to be fitted is revealed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Accurate Algorithm to Ellipse Fitting for Iris Boundary Using Most Iris Edges

Ellipse fitting for iris boundary is an important step in eye gaze estimation and iris recognition applications. In most of the proposed algorithms only the edge image is used for ellipse fitting. In these algorithms, the undesired edges may lead to erroneous iris ellipse. In this paper, we propose a novel algorithm to ellipse fitting for iris boundary which uses gray and edge images simultaneo...

متن کامل

Guaranteed Ellipse Fitting with the Sampson Distance

When faced with an ellipse fitting problem, practitioners frequently resort to algebraic ellipse fitting methods due to their simplicity and efficiency. Currently, practitioners must choose between algebraic methods that guarantee an ellipse fit but exhibit high bias, and geometric methods that are less biased but may no longer guarantee an ellipse solution. We address this limitation by propos...

متن کامل

Geometric primitive feature extraction - concepts, algorithms, and applications

This thesis presents important insights and concepts related to the topic of the extraction of geometric primitives from the edge contours of digital images. Three specific problems related to this topic have been studied, viz., polygonal approximation of digital curves, tangent estimation of digital curves, and ellipse fitting anddetection from digital curves. For the problem of polygonal appr...

متن کامل

Interactive Brain Tumor Segmentation with Inclusion Constraints

This thesis proposes an improved interactive brain tumor segmentation method based on graph cuts, which is an efficient global optimization framework for image segmentation, and star shape, which is a general segmentation shape prior with minimal user assistance. Our improvements lie in volume ballooning, compactness measure and inclusion constraints. Volume ballooning is incorporated to help t...

متن کامل

Ellipse Fitting Using Orthogonal Hyperbolae and Stirling's Oval

Two methods for approximating the normal distance to an ellipse using a) its orthogonal hyperbolae, and b) Stirling’s oval are described. Analysis with a set of quantitative set of measures shows that the former provides an accurate approximation with little irregularities or biases. Its suitability is evaluated by comparing several approximations as error of fit functions and applying them to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006